A novel PID-like particle swarm optimizer: on terminal convergence analysis

نویسندگان

چکیده

Abstract In this paper, a novel proportion-integral-derivative-like particle swarm optimization (PIDLPSO) algorithm is presented with improved terminal convergence of the dynamics. A derivative control term introduced into traditional (PSO) so as to alleviate overshoot problem during stage convergence. The velocity updated according past momentum, present positions (including personal best position and global position), future trend positions, thereby accelerating adjusting search direction jump out area around local optima. By using combination Routh stability criterion final value theorem Z -transformation, conditions are obtained for developed PIDLPSO algorithm. Finally, experiment results reveal superiority designed over several other state-of-the-art PSO variants in terms population diversity, searching ability rate.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Parallel Particle Swarm Optimizer

1. Abstract Time requirements for the solving of complex large-scale engineering problems can be substantially reduced by using parallel computation. Motivated by a computationally demanding biomechanical system identification problem, we introduce a parallel implementation of a stochastic population based global optimizer, the Particle Swarm Algorithm as a means of obtaining increased computat...

متن کامل

A novel particle swarm optimizer hybridized with extremal optimization

Particle swarm optimization (PSO) has received increasing interest from the optimization community due to its simplicity in implementation and its inexpensive computational overhead. However, PSO has premature convergence, especially in complex multimodal functions. Extremal Optimization (EO) is a recently developed local-search heuristic method and has been successfully applied to a wide varie...

متن کامل

Convergence Analysis of Particle Swarm Optimizer and Its Improved Algorithm Based on Velocity Differential Evolution

This paper presents an analysis of the relationship of particle velocity and convergence of the particle swarm optimization. Its premature convergence is due to the decrease of particle velocity in search space that leads to a total implosion and ultimately fitness stagnation of the swarm. An improved algorithm which introduces a velocity differential evolution (DE) strategy for the hierarchica...

متن کامل

Robust Particle Swarm Optimizer based on Chemomimicry

Particle swarm optimizers (PSO) were first introduced by Kennedy and Eberhart as stochastic algorithms which seek optimal solutions to functions through the use of swarm intelligence [1]. The main theme of PSO is that many particles are allowed to explore a function space. As each particle relocates it inputs its coordinates into the objective function for evaluation. Particles are assigned dir...

متن کامل

Runtime analysis of a binary particle swarm optimizer

We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles searching for good solutions. Each particle consists of a current position from {0, 1}n, an own best position and a velocity vector used in a probabilistic process to update its current position. The velocities for a particl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Complex & Intelligent Systems

سال: 2021

ISSN: ['2198-6053', '2199-4536']

DOI: https://doi.org/10.1007/s40747-021-00589-2